Partitioning sparse graphs into an independent set and a graph with bounded size components
نویسندگان
چکیده
منابع مشابه
Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree
An (I,Fd)-partition of a graph is a partition of the vertices of the graph into two sets I and F , such that I is an independent set and F induces a forest of maximum degree at most d. We show that for all M < 3 and d ≥ 2 3−M − 2, if a graph has maximum average degree less than M , then it has an (I,Fd)-partition. Additionally, we prove that for all 8 3 ≤ M < 3 and d ≥ 1 3−M , if a graph has ma...
متن کاملPartitioning into graphs with only small components
The paper presents several results on edge partitions and vertex partitions of graphs into graphs with bounded size components. We show that every graph of bounded tree-width and bounded maximum degree admits such partitions. We also show that an arbitrary graph of maximum degree four has a vertex partition into two graphs, each of which has components on at most 57 vertices. Some generalizatio...
متن کاملPartitioning graphs into balanced components
We consider the k-balanced partitioning problem, where the goal is to partition the vertices of an input graph G into k equally sized components, while minimizing the total weight of the edges connecting different components. We allow k to be part of the input and denote the cardinality of the vertex set by n. This problem is a natural and important generalization of well-known graph partitioni...
متن کاملDecomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
For a loopless multigraph G, the fractional arboricity Arb(G) is the maximum of |E(H)| |V (H)|−1 over all subgraphs H with at least two vertices. Generalizing the NashWilliams Arboricity Theorem, the Nine Dragon Tree Conjecture asserts that if Arb(G) ≤ k + d k+d+1 , then G decomposes into k + 1 forests with one having maximum degree at most d. The conjecture was previously proved for (k, d) ∈ {...
متن کاملPartitioning Random Graphs into Monochromatic Components
Erdős, Gyárfás, and Pyber (1991) conjectured that every r-colored complete graph can be partitioned into at most r − 1 monochromatic components; this is a strengthening of a conjecture of Lovász (1975) and Ryser (1970) in which the components are only required to form a cover. An important partial result of Haxell and Kohayakawa (1995) shows that a partition into r monochromatic components is p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111921